Differentially Private Combinatorial Cloud Auction
نویسندگان
چکیده
Cloud service providers typically provide different types of virtual machines (VMs) to cloud users with various requirements. Thanks its effectiveness and fairness, auction has been widely applied in this heterogeneous resource allocation. Recently, several strategy-proof combinatorial auction mechanisms have proposed. However, they fail protect the bid privacy from being inferred results. In article, we design a xmlns:xlink="http://www.w3.org/1999/xlink">differentially private mechanism (DPCA) address issue. Technically, employ exponential compute clearing unit price vector probability proportional corresponding revenue. We further improve reduce running time while maintaining high revenues, by computing single price, or subgroup prices at time, resulting improved DPCA-S generalized version DPCA-M, respectively. theoretically prove that our can guarantee differential privacy, approximate truthfulness Extensive experimental results demonstrate DPCA generate near-optimal revenues relatively complexity, achieve tunable trade-off between revenue time.
منابع مشابه
Differentially Private Local Electricity Markets
Privacy-preserving electricity markets have a key role in steering customers towards participation in local electricity markets by guarantying to protect their sensitive information. Moreover, these markets make it possible to statically release and share the market outputs for social good. This paper aims to design a market for local energy communities by implementing Differential Privacy (DP)...
متن کاملCombinatorial Auction-Based Marketplace Mechanism for Cloud Service Reservation
This paper proposes a combinatorial auction-based marketplace mechanism for cloud computing services, which allows users to reserve arbitrary combination of services at requested timeslots, prices and quality of service. The proposed mechanism helps enterprise users build workflow applications in a cloud computing environment, specifically on the platform-as-a-service, where the users need to c...
متن کاملStopWatch : Toward “Differentially Private” Timing for Cloud Executions
This paper describes StopWatch , a system that defends against timing-based side-channel attacks that arise from coresidency of victims and attackers in infrastructureas-a-service cloud environments. StopWatch triplicates each cloud-resident guest virtual machine (VM) and places replicas so that the three replicas of a guest VM are coresident with nonoverlapping sets of (replicas of) other VMs....
متن کاملCombinatorial auction design.
Combinatorial auctions allow for more expressive bidding in which participants can submit package bids with logical constraints that limit allowable outcomes. This type of auction can be useful when participants' values are complementary or when participants have production and financial constraints. However, combinatorial auctions are currently rare in practice. The main problems confronted in...
متن کاملTruthful Combinatorial Double Auction For Combinatorial Exchanges
First-come-first-serve (FCFS) scheme is used for selling the goods in market that is a multi-million dollar industry for any popular event. But in a competitive environment is this FCFS efficient? In earlier literature it has been shown that the auction based alternative solutions using the framework of mechanism design, a sub field of game theory [18] can provide better results against FCFS in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Cloud Computing
سال: 2023
ISSN: ['2168-7161', '2372-0018']
DOI: https://doi.org/10.1109/tcc.2021.3097328